Bijective combinatorics of positive braids
نویسنده
چکیده
We give a new and bijective proof for the formula of the growth function of the positive braid monoid with respect to Artin generators.
منابع مشابه
Kernel operators and improved inclusion-exclusion bounds
We present a new and elementary proof of some recent improvements of the classical inclusion-exclusion bounds. The key idea is to use an injective mapping, similar to the bijective mapping in Garsia and Milne’s “bijective” proof of the classical inclusion-exclusion principle.
متن کاملComposition problems for braids: Membership, Identity and Freeness
In this paper we investigate the decidability and complexity of problems related to braid composition. While all known problems for a class of braids with three strands, B3, have polynomial time solutions we prove that a very natural question for braid composition, the membership problem, is NP-complete for braids with only three strands. The membership problem is decidable in NP for B3, but it...
متن کاملComposition Problems for Braids
In this paper we investigate the decidability and complexity of problems related to braid composition. While all known problems for a class of braids with 3 strands, B3, have polynomial time solutions we prove that a very natural question for braid composition, the membership problem, is NP-hard for braids with only 3 strands. The membership problem is decidable for B3, but it becomes harder fo...
متن کاملOn some primary and secondary structures in combinatorics
A possible upgrade of a curriculum in undergraduate course in combinatorics is presented by giving more bijective proofs in the standard (or primary) combinatorics and by adding some topics on more refined (or secondary) combinatorics, including Dyck and Motzkin paths, Catalan, Narayana and Motzkin numbers and secondary structures coming from biology. Some log–convexity properties and asymptoti...
متن کاملAction of Braids on Self-distributive Systems
This paper is a survey of recent work about the action of braids on selfdistributive systems. We show how the braid word reversing technique allows one to use new self-distributive systems, leading in particular to a natural linear ordering of the braids. AMS Subject Classification: 20F36, 20N02. It has been observed for many years that there exist a connection between braids and left selfdistr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Notes in Discrete Mathematics
دوره 29 شماره
صفحات -
تاریخ انتشار 2007